Hybridized arrival time control approach to JIT job-shop scheduling
نویسندگان
چکیده
There is a need for highly flexible, low complexity systems with that can handle the large scale real time scheduling problems. In this work, two approaches, artificial intelligence (AI) based genetic algorithms (GA) and control theoretic based arrival time control (ATC) have been combined to achieve the objective of just in time (JIT) scheduling in a job-shop. GA and ATC compliment each other and the hybrid system, relying on its massively parallel architecture can handle large-scale JIT scheduling problems efficiently. The required number of function evaluations decrease drastically and scale polynomially as the problem size increases. Initial results show a 21% improvement in soultion quality over simple ATC and 0.5% improvement over heurisitcal solutions for a sample problem considered here.
منابع مشابه
The Preemptive Just-in-time Scheduling Problem in a Flow Shop Scheduling System
Flow shop scheduling problem has a wide application in the manufacturing and has attracted much attention in academic fields. From other point, on time delivery of products and services is a major necessity of companies’ todays; early and tardy delivery times will result additional cost such as holding or penalty costs. In this paper, just-in-time (JIT) flow shop scheduling problem with preemp...
متن کاملA Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملA fuzzy multi-objective linear programming approach for solving a new multi-objective job shop scheduling with sequence-dependent setup times
This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کامل